منابع مشابه
Pyramid segmentation algorithms revisited
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid. In order to compare the different segmentation algorithms, we have employed three types of quality mea...
متن کاملMatch Chaining Algorithms for cDNA Mapping
We propose a new algorithm called the MCCM (Match Chaining-based cDNA Mapping) algorithm that allows mapping cDNAs to the genomes efficiently and accurately, utilizing local matches called MUMs (maximal unique matches) or MRMs (maximal rare matches) obtained with suffix trees. From the MUMs (or MRMs), our algorithm selects appropriate matches which are related to the cDNA mapping. We call the s...
متن کاملThe Match Game: New Stratigraphic Correlation Algorithms’
New algorithms for automatic correlaiion of geologic strata are introduced. The algorithm are exiensions of the Smith and Waierman (1980) dynamic programming technique and include several features rhat greatly increase the utility for sedimentary sequences. Gaps in correlation (unconformiiies) caused by local nondeposiiion or eroded strata can include in a single “event” several strata. Furiher...
متن کاملElementary algebra revisited: Randomized algorithms
We look at some simple algorithms for elementary problems in algebra that yield dramatic efficiency improvements over standard methods through randomization. The randomized algorithms are, in a sense, “obvious”. Their formal statement was delayed partly by the need for rigorous analysis, but more so by the need to re-think traditional approaches to elementary algorithms. We illustrate this phil...
متن کاملPrimal cutting plane algorithms revisited
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic Medicine
سال: 1996
ISSN: 1040-2446
DOI: 10.1097/00001888-199605000-00002